Polynomial inference of universal automata from membership and equivalence queries
نویسندگان
چکیده
A MAT learning algorithm is presented that infers the universal automaton for a regular target language, using a polynomial number of queries with respect to that automaton. The universal automaton is one of several canonical characterizations for regular languages Our learner is based on the concept of an observation table, which seems to be particularly fitting for this computational model, and we adapt the necessary notions and definitions from the literature to the case of universal automata.
منابع مشابه
Learning non-deterministic finite automata from queries and counterexamples
In the recent theoretical research activity of inductive learning, in particular, of inductive inference, Angluin has introduced the model of learning called minimally adequate teacher (MAT), that is, the model of learning via membership queries and equivalence queries, and has shown that the class of regular languages is e ciently learnable using deterministic nite automata (DFAs) (Angluin 198...
متن کاملOne-shot learning and the polynomial characterizability barrier
We survey two existing algorithms for the inference of finite-state tree automata from membership queries and a finite positive sample or equivalence queries, and we suggest a correction for one of them which we deem necessary in order to ensure its termination. We present two algorithms for the same two settings when the underlying description is not a deterministic but a residual canonical fi...
متن کاملThe Complexity of Learning Branches and Strategies from Queries
The problems of learning strategies for closed innnite games (as a model for learning process controllers) and of learning innnite branches of computable trees have been introduced in inductive inference. We study the complexity of these problems in a query learning model for closed games and trees represented by deterministic nite automata. We show that already for nite-state trees, which are ...
متن کاملLearning k-edge Deterministic Finite Automata in the Framework of Active Learning
One of most attractive topics in grammatical inference is theoretically study on learnability of some classes of automata corresponding with defined formal languages. For last two decades a number of theoretical results have been reported and played as essential knowledge for applications in other fileds such as speech recognition and music-style recognition. In this paper, we consider the prob...
متن کاملLearning Multiplicity Tree Automata
In this paper, we present a theoretical approach for the problem of learning multiplicity tree automata. These automata allows one to define functions which compute a number for each tree. They can be seen as a strict generalization of stochastic tree automata since they allow to define functions over any field K. A multiplicity automaton admits a support which is a non deterministic automaton....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 246 شماره
صفحات -
تاریخ انتشار 2016